Written Examination, May 29th, 2015 Course noThe duration of the examination is 4 hours. Course Name: Functional programming

Source URL: www.imm.dtu.dk

• Academic transfer
• Computability theory
• Recursion
• Subroutines
• Theoretical computer science
• Grading systems by country

SUBMITTED TO IEEE TRANS. ON AUTOMATIC CONTROL - TECHNICAL NOTE, APRILSwitching and PI Control of Walking Motions of Planar Biped Walkers E.R. Westervelt∗ , J.W. Grizzle+ , and C. Canudas de Wit×

Source URL: web.eecs.umich.edu

• Probability distributions
• Motion planning
• Theoretical computer science
• Closed and exact differential forms
• Relationships among probability distributions
• Table of stars with Bayer designations

Noname manuscript No. (will be inserted by the editor) Extending Sledgehammer with SMT Solvers Jasmin Christian Blanchette · Sascha Böhme · Lawrence C. Paulson

Source URL: people.mpi-inf.mpg.de

• Logic in computer science
• Automated theorem proving
• Formal methods
• Theoretical computer science
• Constraint programming
• Satisfiability modulo theories
• Z3
• Isabelle
• Formal verification
• Proof assistant
• Automated reasoning
• E theorem prover

Explicit and Implicit Enforcing – Randomized Optimization Bernd G¨artner and Emo Welzl Theoretical Computer Science, ETH Z¨ urich, CH-8092 Z¨ urich, Switzerland

Source URL: people.inf.ethz.ch

• Binomial coefficient
• Combinatorics
• Forcing
• XTR
• Norm

Areas of Interest Amotz Bar-Noy Field: Theoretical Computer Science. Speciality: Design, analysis, implementation, and evaluation of Algorithms; Combinatorial Optimization.

Source URL: www.sci.brooklyn.cuny.edu

A simple, distributed implementation of the pi-calculus, using explicit fusions Pisa, JulyLucian Wischik

Source URL: www.wischik.com

• Process calculi
• Theoretical computer science
• -calculus
• Substitution
• Heat equation

Electronic Communications of the EASST VolumeProceedings of the 15th International Workshop on Automated Verification of Critical Systems (AVoCS 2015)

Source URL: www.cse.chalmers.se

• Mathematical logic
• Mathematical proofs
• Theoretical computer science
• Mathematical induction
• Recursion
• Structural induction
• Rippling
• Algorithm
• Theorem

From F? to SMT (Extended Abstract) Alejandro Aguirre1,2 1 Inria Paris

Source URL: prosecco.gforge.inria.fr

• Theoretical computer science
• Formal methods
• Computability theory
• Functional languages
• Logic in computer science
• Satisfiability modulo theories
• Factorial
• ML
• Recursion
• Lambda calculus
• System F

BASIS PURSUIT IN SENSOR NETWORKS João F. C. Mota1,2 , João M. F. Xavier2 , Pedro M. Q. Aguiar2 , and Markus Püschel3 1 Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, USA 2

Source URL: www.ee.ucl.ac.uk

• Operations research
• Combinatorial optimization
• Theoretical computer science
• Convex optimization
• A* search algorithm
• Algorithm
• NP
• Linear programming
• Belief propagation
• Mean value analysis

Faculty  Members  and  Labs  in  Department  of  Computer  Science Professor Masami Hagiya The world is full of computation! From Anshin-Anzen (reliable and safe) to Ayashii-Abunai (enigmatic and adventurous) Whi

Source URL: www.i.u-tokyo.ac.jp

• Theoretical computer science
• Emerging technologies
• Bioinformatics
• Computer science
• Natural computing
• Quantum computing
• Computational science
• Systems biology
• Computing
• Quantum information
• Machine learning
• Outline of computer science